搜索资源列表
suanfa
- 用动态规划实现三角问题，用贪心算法实现装在问题和最短源路径问题-Triangle problems using dynamic programming, greedy algorithms installed in the path of the problem and the shortest source
GridRoad1
- 格路算法实现，用动态规划的方法解决从一个网格起点到终点的最短路径问题-Lattice paths algorithm, dynamic programming method to solve the shortest path from a grid start to finish
ten-algorithm
- 目录 1，搜索算法； 2，贪心算法； 3，动态规划； 4，最短路径； 5，最小生成树； 6，二分图的最大匹配； 7，-Contents 1, the search algorithm 2, the greedy algorithm 3, dynamic programming 4, the shortest path 5, the minimum spanning tree 6, maximum bipartite matching 7, ...
algorithm
- 关于常用的几种算法介绍1、单源最短路径；2、递归与分治；3、贪心算法；4、动态规划；5、回溯法；6、分支限界法-On several commonly used algorithm introduced a single-source shortest path 2, recursion and divide and conquer 3, the greedy algorithm 4, dynamic programming 5, backtracking 6, branch and
dtw
- 这个算法是基于动态规划（DP）的思想，解决了发音长短不一的模板匹配问题，简单来说，就是通过构建一个邻接矩阵，寻找最短路径和。-This algorithm is based on the idea of dynamic programming (DP) to solve the problem of template matching pronunciation of varying lengths, simply put, is by building an adj
The-shortest-path
- 用贪心法和动态规划两种算法求解有向图任意两个节点之间的最短路径，要求给出最短路径的值以及中间路径。-Greedy method and dynamic programming algorithm to solve the two have to figure the shortest path between any two nodes, required to give the value of the shortest path and the middle path.
shortest-path-tree
- 数字三角形最短路径，使用动态规划思想,从最低层开始计算D-Digital Triangle shortest path, using dynamic programming, counting from the lowest D
dongtaiguihua
- 基于MATLAB语言，采用动态规划方法求解最短路径问题-Based on MATLAB language, using dynamic programming method for solving the shortest path problem
dtw
- 这个算法是基于动态规划（DP）的思想，解决了发音长短不一的模板匹配问题，简单来说，就是通过构建一个邻接矩阵，寻找最短路径和。-This algorithm is based on the idea of dynamic programming (DP) to solve the problem of template matching pronunciation of varying lengths, in simple terms, is by building a
Acm-
- acm动态规划经典习题解析，其中有很多经典案例，如数塔问题、最短路径问题、骑士游历问题等。-Acm dynamic programming classic problem sets, there are a lot of classic case, all to solve the problem, the shortest path problem, knight tour, etc.
2014072020
- 这是一个动态规划的问题，这个程序实现的是求多段图最短路径，汉诺塔和01背包问题的程序-This is a dynamic programming problem, the program is seeking to achieve the shortest path map multistage procedure Tower of Hanoi and 01 knapsack problem
DynamicProgrammingShortestPath
- 动态规划求最短路径，已知几个城市的位置坐标，求出便利各个城市的最短路径-Dynamic programming for the shortest path to a known location coordinates of several cities, find the shortest path to facilitate various cities
Floyd
- Floyd算法：Floyd算法是一个经典的动态规划算法,用来计算两点之间最短路径。-Floyd algorithms: Floyd algorithm is a classical dynamic programming algorithm is used to calculate the shortest path between two points.
My_GridRoad-1.0
- 格路问题 -算法分析之动态规划 MFC文档编程，可视化实现格路问题，即寻找从始点到终点的最短路径的问题，可视化显示网格以及网格的距离数值，可以设定网格大小以及对每个点的信息右键进行查看和修改。 动态规划方法。 C++6.0编写- - Grid road problem dynamic programming algorithm analysis of MFC programming documentation, visualization achieve grid road problems
floyd
- 适用于APSP(All Pairs Shortest Paths，多源最短路径)，是一种动态规划算法，稠密图效果最佳，边权可正可负。此算法简单有效-floyd All Pairs Shortest Paths
floyd
- Floyd算法又称为插点法，是一种利用动态规划的思想寻找给定的加权图中多源点之间最短路径的算法，与Dijkstra算法类似。(Shortest path algorithm)
算法
- floyd算法又称为插点法，是一种利用动态规划的思想寻找给定的加权图中多源点之间最短路径的算法，模拟退火算法是局部最优解能概率性地跳出并最终趋于全局最优，遗传算法是一种通过模拟自然进化过程搜索最优解的方法。(The Floyd algorithm is also known as the insertion point method, which is a multi weighted graph using the idea of dynamic programming for the giv
floyd
- Floyd算法又称为插点法，是一种利用动态规划的思想寻找给定的加权图中多源点之间最短路径的算法，与Dijkstra算法类似(Floyd algorithm, also called plug point method, is an algorithm based on the idea of dynamic programming to find the shortest path between multiple source points in a weighted graph, simil
DXEmp
- 基于ArcEngine C#开发的一个简单GIS，可以实现空间查询，模糊查询，最短路径规划，还包括一个动态启动界面(A GIS based on ArcEngine,written on by C#.Its functions include spatial querying,fuzzy searching,shorted route analyst.)
DWA
- DLite算法是Koenig S和Likhachev M基于LPA算法基础上提出的路径规划算法。 LPA算法本是基于Dijkstra最短路径算法而产生的定起点、定目标点的路径规划算法。 链接 通过对LPA算法的改造，使LPA*算法的思想能应用到诸如车辆动态导航这样的问题。